Coloring translates and homothets of a convex body
نویسندگان
چکیده
We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of finite families of translates and homothets of a convex body in R.
منابع مشابه
University of Alberta Some Inequalities in Convex Geometry
We present some inequalities in convex geometry falling under the broad theme of quantifying complexity, or deviation from particularly pleasant geometric conditions: we give an upper bound for the Banach–Mazur distance between an origin-symmetric convex body and the n-dimensional cube which improves known bounds when n ≥ 3 and is “small”; we give the best known upper and lower bounds (for high...
متن کاملMore on Decomposing Coverings by Octants
In this note we improve our upper bound given in [7] by showing that every 9-fold covering of a point set in R by finitely many translates of an octant decomposes into two coverings, and our lower bound by a construction for a 4-fold covering that does not decompose into two coverings. We also prove that certain dynamic interval coloring problems are equivalent to the above question. The same b...
متن کاملHelly-type Theorems for Homothets of Planar Convex Curves
Helly’s theorem implies that if S is a finite collection of (positive) homothets of a planar convex body B, any three having non-empty intersection, then S has non-empty intersection. We show that for collections S of homothets (including translates) of the boundary ∂B, if any four curves in S have non-empty intersection, then S has non-empty intersection. We prove the following dual version: I...
متن کاملGeneralized Delaunay Graphs with respect to any Convex Set are Plane Graphs
We consider two types of geometric graphs on point sets on the plane based on a plane set C: one obtained by translates of C, another by positively scaled translates (homothets) of C. For compact and convex C, graphs defined by scaled translates of C, i.e., Delaunay graphs based on C, are known to be plane graphs. We show that as long as C is convex, both types of graphs are plane graphs.
متن کاملOn the transversal number and VC-dimension of families of positive homothets of a convex body
Let F be a family of positive homothets (or translates) of a given convex body K in Rn. We investigate two approaches to measuring the complexity of F . First, we find an upper bound on the transversal number τ(F) of F in terms of n and the independence number ν(F). This question is motivated by a problem of Grünbaum [2]. Our bound τ(F) ≤ 2n (2n n ) (n logn+ log logn+ 5n)ν(F) is exponential in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1008.1360 شماره
صفحات -
تاریخ انتشار 2010